An Exercice in LP : The Proof of a Non Restoring Division Circuit
Identifieur interne : 00D410 ( Main/Exploration ); précédent : 00D409; suivant : 00D411An Exercice in LP : The Proof of a Non Restoring Division Circuit
Auteurs : B. Chetali ; Pierre Lescanne [France]Source :
Abstract
This paper describes our experience in using the Larch Prover to verify correctness of a digital circuit. We took as an example the proof made by Verkest \& al of the correctness of the Cathedral-II ALU and we tried to make a similar proof with LP. The proof consists in checking the correctness of the non restoring division algorithm with respect to an abstract specification, and then proving that this algorithm was correctly implemented on the Cathedral-II ALU.
Affiliations:
- France
- Grand Est, Lorraine (région)
- Nancy
- Centre national de la recherche scientifique, Institut national de recherche en informatique et en automatique, Laboratoire lorrain de recherche en informatique et ses applications, Université de Lorraine
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: 000E96
- to stream Crin, to step Curation: 000E96
- to stream Crin, to step Checkpoint: 003667
- to stream Main, to step Merge: 00DC87
- to stream Main, to step Curation: 00D410
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="408">An Exercice in LP : The Proof of a Non Restoring Division Circuit</title>
</titleStmt>
<publicationStmt><idno type="RBID">CRIN:chetali92b</idno>
<date when="1992" year="1992">1992</date>
<idno type="wicri:Area/Crin/Corpus">000E96</idno>
<idno type="wicri:Area/Crin/Curation">000E96</idno>
<idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">000E96</idno>
<idno type="wicri:Area/Crin/Checkpoint">003667</idno>
<idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">003667</idno>
<idno type="wicri:Area/Main/Merge">00DC87</idno>
<idno type="wicri:Area/Main/Curation">00D410</idno>
<idno type="wicri:Area/Main/Exploration">00D410</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">An Exercice in LP : The Proof of a Non Restoring Division Circuit</title>
<author><name sortKey="Chetali, B" sort="Chetali, B" uniqKey="Chetali B" first="B." last="Chetali">B. Chetali</name>
</author>
<author><name sortKey="Lescanne, P" sort="Lescanne, P" uniqKey="Lescanne P" first="P." last="Lescanne">Pierre Lescanne</name>
<affiliation><country>France</country>
<placeName><settlement type="city">Nancy</settlement>
<region type="region" nuts="2">Grand Est</region>
<region type="region" nuts="2">Lorraine (région)</region>
</placeName>
<orgName type="laboratoire" n="5">Laboratoire lorrain de recherche en informatique et ses applications</orgName>
<orgName type="university">Université de Lorraine</orgName>
<orgName type="institution">Centre national de la recherche scientifique</orgName>
<orgName type="institution">Institut national de recherche en informatique et en automatique</orgName>
</affiliation>
</author>
</analytic>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass></textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en" wicri:score="1310">This paper describes our experience in using the Larch Prover to verify correctness of a digital circuit. We took as an example the proof made by Verkest \& al of the correctness of the Cathedral-II ALU and we tried to make a similar proof with LP. The proof consists in checking the correctness of the non restoring division algorithm with respect to an abstract specification, and then proving that this algorithm was correctly implemented on the Cathedral-II ALU.</div>
</front>
</TEI>
<affiliations><list><country><li>France</li>
</country>
<region><li>Grand Est</li>
<li>Lorraine (région)</li>
</region>
<settlement><li>Nancy</li>
</settlement>
<orgName><li>Centre national de la recherche scientifique</li>
<li>Institut national de recherche en informatique et en automatique</li>
<li>Laboratoire lorrain de recherche en informatique et ses applications</li>
<li>Université de Lorraine</li>
</orgName>
</list>
<tree><noCountry><name sortKey="Chetali, B" sort="Chetali, B" uniqKey="Chetali B" first="B." last="Chetali">B. Chetali</name>
</noCountry>
<country name="France"><region name="Grand Est"><name sortKey="Lescanne, P" sort="Lescanne, P" uniqKey="Lescanne P" first="P." last="Lescanne">Pierre Lescanne</name>
</region>
</country>
</tree>
</affiliations>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00D410 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 00D410 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= Main |étape= Exploration |type= RBID |clé= CRIN:chetali92b |texte= An Exercice in LP : The Proof of a Non Restoring Division Circuit }}
This area was generated with Dilib version V0.6.33. |